package leetcode.editor.cn;
 
/**
 * 爬楼梯
 * @author qulq
 * @date 2024-07-09 19:11:36
 */
public class T70_ClimbingStairs{
	 public static void main(String[] args) {
	 	 //测试代码
	 	 Solution solution = new T70_ClimbingStairs().new Solution();
	 }
	 
//力扣代码
//leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int climbStairs(int n) {
		if (n == 1 || n == 2) {
			return n;
		}
		int[] dp = new int[n + 1];
		dp[1] = 1;
		dp[2] = 2;
		for (int i = 3; i <= n; i++) {
			dp[i] = dp[i - 1] + dp[i - 2];
		}
		return dp[n];
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}